package com.lintcode.solution;

import com.lintcode.solution.entity.TreeNode;

import java.util.ArrayList;
import java.util.List;

public class Solution_66 {
    public static void main(String[] args) {
        System.out.println(10 << 5);
        Math.sqrt(3);
    }
    
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        
        return list;
    }
}
